Model Checking and Modular Veri cation
نویسندگان
چکیده
We describe a framework for compositional veri cation of nite state processes The framework is based on two ideas a subset of the logic CTL for which satisfaction is preserved under composition and a preorder on structures which captures the relation between a component and a system containing the component Satisfaction of a formula in the logic corresponds to being below a particular structure a tableau for the formula in the preorder We show how to do assume guarantee style reasoning within this framework In addition we demonstrate e cient methods for model checking in the logic and for checking the preorder in several special cases We have implemented a system based on these methods and we use it to give a compositional veri cation of a CPU controller
منابع مشابه
Abstraction and Modular Veriication of Innnite-state Reactive Systems ?
ion and Modular Veri cation of In nite-State Reactive Systems ? Zohar Manna, Michael A. Col on, Bernd Finkbeiner, Henny B. Sipma and Tom as E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal veri cation techniques for reactive systems using modularity and abstraction. Their use allows the veri cation o...
متن کاملExploiting Syntactic Structure for
Introduction Model Checking Techniques Hardware Veri cation Software Veri cation Overview of this work Model Checking for Temporal Logics Models of Systems Speci cations Model Checking Exploiting Structure in Software Veri cation The Structure of Programs Non deterministic While Programs Control Flow Graphs Semantics of Programs Modular Model Checking Partition Graphs Operations on Assumption F...
متن کاملIntegration of Bounded Model Checking and Deductive Verification
Modular deductive veri cation of software systems is a complex task: the user has to put a lot of e ort in writing module speci cations that t together when verifying the system as a whole. In this paper, we propose a combination of deductive veri cation and software bounded model checking (SBMC), where SBMC is used to support the user in the speci cation and veri cation process, while deductiv...
متن کاملModel Checking and UTP Design Veri cation
We give a di erent perspective on veri cation of programs. Our perspective emphasizes the use of design veri cation in the uni ed theory of programming. The main idea is that of applying model checking to the veri cation of programs expressed in the pre and postcondition style of the uni ed theory of programming, leading to a closer relationship between program development and program veri cati...
متن کاملModular Minimization of Deterministic Finite State Machines
This work presents a modular technique for minimizing a deterministic nite state ma chine FSM while preserving its equivalence to the original system Being modular the minimization technique should consume less time and space Preserving equivalence the resulting minimized model can be employed in both temporal logic model checking and sequential equivalence checking thus reducing their time and...
متن کامل